Distributed Consensus in Wireless Networks With Probabilistic Broadcast Scheduling

We consider distributed average consensus in a wireless network with partial communication to reduce the number of transmissions every iteration/round. Considering broadcast nature channels, we propose probabilistic approach that schedules subset nodes for broadcasting information their neighbors round. compare several heuristic methods assigning node probabilities under fixed per Furthermore, introduce pre-compensation method correct bias between value and initial values, suggest possible extensions our design. Our results are particularly relevant developing communication-efficient protocols environment limited frequency/time resources.